Ultra-small scale-free geometric networks
نویسندگان
چکیده
منابع مشابه
Ultra-small scale-free geometric networks
We consider a family of long-range percolation models (Gp)p>0 on Zd allowing dependence between edges and having these connectivity properties for p ∈ (1/d,∞): (i) the degree distribution of vertices in Gp has a power law distribution, (ii) the graph distance between points x and y is bounded by a multiple of logpd logpd |x − y| with probability 1 − o(1), and (iii) an adversary can delete a rel...
متن کاملUltra-Fast Load Balancing on Scale-Free Networks
The performance of large distributed systems crucially depends on efficiently balancing their load. This has motivated a large amount of theoretical research how an imbalanced load vector can be smoothed with local algorithms. For technical reasons, the vast majority of previous work focuses on regular (or almost regular) graphs including symmetric topologies such as grids and hypercubes, and i...
متن کاملGeometric fractal growth model for scale-free networks.
We introduce a deterministic model for scale-free networks, whose degree distribution follows a power law with the exponent gamma. At each time step, each vertex generates its offspring, whose number is proportional to the degree of that vertex with proportionality constant m-1 (m>1). We consider the two cases: First, each offspring is connected to its parent vertex only, forming a tree structu...
متن کاملA Geometric Fractal Growth Model for Scale Free Networks
We introduce a deterministic model for scale-free networks, whose degree distribution follows a power-law with an exponent γ. At each time step, each vertex generates its offsprings, whose number is proportional to the degree of that vertex with proportionality constant m − 1 (m > 1). We consider the two cases: first, each offspring is connected to its parent vertex only, forming a tree structu...
متن کاملExactly scale-free scale-free networks
Many complex natural and physical systems exhibit patterns of interconnection that conform, approximately, to a network structure referred to as scale-free. Preferential attachment is one of many algorithms that have been introduced to model the growth and structure of scale-free networks. With so many different models of scale-free networks it is unclear what properties of scale-free networks ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2006
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200002011